Diversifying Top-K Results

Top-k query processing finds a list of k results that have largest scores w.r.t the user given query, with the assumption that all the k results are independent to each other. In practice, some of the top-k results returned can be very similar to each other. As a result some of the top-k results returned are redundant. In the literature, diversified top-k search has been studied to return k results that take both score and diversity into consideration. Most existing solutions on diversified top-k search assume that scores of all the search results are given, and some works solve the diversity problem on a specific problem and can hardly be extended to general cases. In this paper, we study the diversified top-k search problem. We define a general diversified top-k search problem that only considers the similarity of the search results themselves. We propose a framework, such that most existing solutions for top-k query processing can be extended easily to handle diversified top-k search, by simply applying three new functions, a sufficient stop condition sufficient(), a necessary stop condition necessary(), and an algorithm for diversified top-k search on the current set of generated results, div-search-current(). We propose three new algorithms, namely, div-astar, div-dp, and div-cut to solve the div-search-current() problem. div-astar is an A* based algorithm, div-dp is an algorithm that decomposes the results into components which are searched using div-astar independently and combined using dynamic programming. div-cut further decomposes the current set of generated results using cut points and combines the results using sophisticated operations. We conducted extensive performance studies using two real datasets, enwiki and reuters. Our div-cut algorithm finds the optimal solution for diversified top-k search problem in seconds even for k as large as 2,000.Comment: VLDB201

A Fast Order-Based Approach for Core Maintenance

Graphs have been widely used in many applications such as social networks, collaboration networks, and biological networks. One important graph analytics is to explore cohesive subgraphs in a large graph. Among several cohesive subgraphs studied, k-core is one that can be computed in linear time for a static graph. Since graphs are evolving in real applications, in this paper, we study core maintenance which is to reduce the computational cost to compute k-cores for a graph when graphs are updated from time to time dynamically. We identify drawbacks of the existing efficient algorithm, which needs a large search space to find the vertices that need to be updated, and has high overhead to maintain the index built, when a graph is updated. We propose a new order-based approach to maintain an order, called k-order, among vertices, while a graph is updated. Our new algorithm can significantly outperform the state-of-the-art algorithm up to 3 orders of magnitude for the 11 large real graphs tested. We report our findings in this paper

Low Dose CT Image Reconstruction With Learned Sparsifying Transform

A major challenge in computed tomography (CT) is to reduce X-ray dose to a low or even ultra-low level while maintaining the high quality of reconstructed images. We propose a new method for CT reconstruction that combines penalized weighted-least squares reconstruction (PWLS) with regularization based on a sparsifying transform (PWLS-ST) learned from a dataset of numerous CT images. We adopt an alternating algorithm to optimize the PWLS-ST cost function that alternates between a CT image update step and a sparse coding step. We adopt a relaxed linearized augmented Lagrangian method with ordered-subsets (relaxed OS-LALM) to accelerate the CT image update step by reducing the number of forward and backward projections. Numerical experiments on the XCAT phantom show that for low dose levels, the proposed PWLS-ST method dramatically improves the quality of reconstructed images compared to PWLS reconstruction with a nonadaptive edge-preserving regularizer (PWLS-EP).Comment: This is a revised and corrected version of the IEEE IVMSP Workshop paper DOI: 10.1109/IVMSPW.2016.752821

Deep Manifold Learning for Reading Comprehension and Logical Reasoning Tasks with Polytuplet Loss

The current trend in developing machine learning models for reading comprehension and logical reasoning tasks is focused on improving the models' abilities to understand and utilize logical rules. This work focuses on providing a novel loss function and accompanying model architecture that has more interpretable components than some other models by representing a common strategy employed by humans when given reading comprehension and logical reasoning tasks. This strategy involves emphasizing relative accuracy over absolute accuracy and can theoretically produce the correct answer without full knowledge of the information required to solve the question. We examine the effectiveness of applying such a strategy to train transfer learning models to solve reading comprehension and logical reasoning questions. The models were evaluated on the ReClor dataset, a challenging reading comprehension and logical reasoning benchmark. We propose the polytuplet loss function, an extension of the triplet loss function, to ensure prioritization of learning the relative correctness of answer choices over learning the true accuracy of each choice. Our results indicate that models employing polytuplet loss outperform existing baseline models. Although polytuplet loss is a promising alternative to other contrastive loss functions, further research is required to quantify the benefits it may present

Microbial light-activatable proton pumps as neuronal inhibitors to functionally dissect neuronal networks in C. elegans

Essentially any behavior in simple and complex animals depends on neuronal network function. Currently, the best-defined system to study neuronal circuits is the nematode Caenorhabditis elegans, as the connectivity of its 302 neurons is exactly known. Individual neurons can be activated by photostimulation of Channelrhodopsin-2 (ChR2) using blue light, allowing to directly probe the importance of a particular neuron for the respective behavioral output of the network under study. In analogy, other excitable cells can be inhibited by expressing Halorhodopsin from Natronomonas pharaonis (NpHR) and subsequent illumination with yellow light. However, inhibiting C. elegans neurons using NpHR is difficult. Recently, proton pumps from various sources were established as valuable alternative hyperpolarizers. Here we show that archaerhodopsin-3 (Arch) from Halorubrum sodomense and a proton pump from the fungus Leptosphaeria maculans (Mac) can be utilized to effectively inhibit excitable cells in C. elegans. Arch is the most powerful hyperpolarizer when illuminated with yellow or green light while the action spectrum of Mac is more blue-shifted, as analyzed by light-evoked behaviors and electrophysiology. This allows these tools to be combined in various ways with ChR2 to analyze different subsets of neurons within a circuit. We exemplify this by means of the polymodal aversive sensory ASH neurons, and the downstream command interneurons to which ASH neurons signal to trigger a reversal followed by a directional turn. Photostimulating ASH and subsequently inhibiting command interneurons using two-color illumination of different body segments, allows investigating temporal aspects of signaling downstream of ASH

Effect of age and cytoskeletal elements on the indentation-dependent mechanical properties of chondrocytes.

Articular cartilage chondrocytes are responsible for the synthesis, maintenance, and turnover of the extracellular matrix, metabolic processes that contribute to the mechanical properties of these cells. Here, we systematically evaluated the effect of age and cytoskeletal disruptors on the mechanical properties of chondrocytes as a function of deformation. We quantified the indentation-dependent mechanical properties of chondrocytes isolated from neonatal (1-day), adult (5-year) and geriatric (12-year) bovine knees using atomic force microscopy (AFM). We also measured the contribution of the actin and intermediate filaments to the indentation-dependent mechanical properties of chondrocytes. By integrating AFM with confocal fluorescent microscopy, we monitored cytoskeletal and biomechanical deformation in transgenic cells (GFP-vimentin and mCherry-actin) under compression. We found that the elastic modulus of chondrocytes in all age groups decreased with increased indentation (15-2000 nm). The elastic modulus of adult chondrocytes was significantly greater than neonatal cells at indentations greater than 500 nm. Viscoelastic moduli (instantaneous and equilibrium) were comparable in all age groups examined; however, the intrinsic viscosity was lower in geriatric chondrocytes than neonatal. Disrupting the actin or the intermediate filament structures altered the mechanical properties of chondrocytes by decreasing the elastic modulus and viscoelastic properties, resulting in a dramatic loss of indentation-dependent response with treatment. Actin and vimentin cytoskeletal structures were monitored using confocal fluorescent microscopy in transgenic cells treated with disruptors, and both treatments had a profound disruptive effect on the actin filaments. Here we show that disrupting the structure of intermediate filaments indirectly altered the configuration of the actin cytoskeleton. These findings underscore the importance of the cytoskeletal elements in the overall mechanical response of chondrocytes, indicating that intermediate filament integrity is key to the non-linear elastic properties of chondrocytes. This study improves our understanding of the mechanical properties of articular cartilage at the single cell level